package DP;

/**
 * @author 曹见朋
 * @create 2024-06-16-21:02
 */
public class Main674 {
    // TODO 674. 最长连续递增序列
    public static int findLengthOfLCIS(int[] nums) {

        int n = nums.length;

        int[] dp = new int[n];
        for(int i = 0; i < n; i++){
            dp[i] = 1;
        }
        int result = 0;
        for(int i = 1; i < n; i++){
            if(nums[i] - nums[i - 1] > 0){
                dp[i] = dp[i - 1] + 1;
            }
            result = Math.max(result, dp[i]);
        }
        return result;
    }

    public static void main(String[] args) {
        int[] nums = new int[]{1,3,5,4,7};
        System.out.println(findLengthOfLCIS(nums));

    }
}
